A Sparse Spectral Deconvolution Algorithm for Non-cartesian Mrsi

نویسندگان

  • Sampada Bhave
  • Ramin Eslami
  • Mathews Jacob
چکیده

Purpose: To minimize line shape distortions and spectral leakage artifacts in MR spectroscopic imaging. Methods: A spatially and spectrally regularized non-Cartesian MRSI algorithm that uses the line shape distortion priors, estimated from water reference data, to deconvolve the spectra is introduced. Sparse spectral regularization is used to minimize noise amplification associated with deconvolution. A spiral MRSI sequence, that heavily oversamples the central k-space regions is used to acquire the MRSI data. The spatial regularization term uses the spatial supports of brain and extra-cranial fat regions to recover the metabolite spectra and nuisance signals at two different resolutions. Specifically, the nuisance signals are recovered at the maximum resolution to minimize spectral leakage, while the point spread functions of metabolites are controlled to obtain acceptable signal to noise ratio. Results: The comparisons of the algorithm against Tikhonov regularized reconstructions demonstrates considerably reduced line shape distortions and improved metabolite maps. Conclusion: The proposed sparsity constrained spectral deconvolution scheme is effective in minimizing the line shape distortions. The dual resolution reconstruction scheme is capable of minimizing spectral leakage artifacts.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Sparse spectral deconvolution algorithm for noncartesian MR spectroscopic imaging.

PURPOSE To minimize line shape distortions and spectral leakage artifacts in MR spectroscopic imaging (MRSI). METHODS A spatially and spectrally regularized non-Cartesian MRSI algorithm that uses the line shape distortion priors, estimated from water reference data, to deconvolve the spectra is introduced. Sparse spectral regularization is used to minimize noise amplification associated with ...

متن کامل

Parallel spectroscopic imaging reconstruction with arbitrary trajectories using k-space sparse matrices.

Parallel imaging reconstruction has been successfully applied to magnetic resonance spectroscopic imaging (MRSI) to reduce scan times. For undersampled k-space data on a Cartesian grid, the reconstruction can be achieved in image domain using a sensitivity encoding (SENSE) algorithm for each spectral data point. Alternative methods for reconstruction with undersampled Cartesian k-space data are...

متن کامل

تجزیه‌ ی تُنُک تصاویر ابرطیفی با استفاده از یک کتابخانه‌ ی طیفی هرس شده

Spectral unmixing of hyperspectral images is one of the most important research fields  in remote sensing. Recently, the direct use of spectral libraries in spectral unmixing is on increase. In this way  which is called sparse unmixing, we do not need an endmember extraction algorithm and the number determination of endmembers priori. Since spectral libraries usually contain highly correlated s...

متن کامل

A novel parallel sparse MRSI reconstruction scheme

INTRODUCTION Low SNR of proton magnetic resonance spectroscopic imaging (MRSI) in vivo data for a small voxel size (e.g., 0.4cc) necessitates multiple-average acquisition that leads to a long scan time. This issue is even more pronounced when one attempts to acquire J-resolved spectroscopic data using multi-echo acquisition [3] in order to resolve metabolite concentrations such as glutamate and...

متن کامل

3D Cartesian and Elliptical GRAPPA Based Spectroscopic Imaging of Gliomas at 3 Tesla

Introduction: 3D MR spectroscopic imaging (3D MRSI) is a powerful tool for diagnosis of brain tumors but long acquisition times in the order of 20-30 minutes causes patient discomfort and motion artifacts. In recent years, several pulse sequence developments proposing different trajectories in k-space such as elliptical sampling (sampling the central elliptical portion of k-space) or echo-plana...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013